منابع مشابه
An Error-Correction Graph Grammar to Recognize Texture Symbols
This paper presents an algorithm for recognizing symbols with textured elements in a graphical document. A region adjacency graph represents the graphical document, with the nodes being polygons and the edges the neighborhood relations between them. The textured symbols are modeled by a graph, where nodes are polygons (represented by strings) or textured areas (represented by a graph grammar wi...
متن کاملAn efficient algorithm to recognize locally equivalent graphs
There are local operators on (labeled) graphs G with labels (gij) in a finite field. If the field is binary, the operations are just the local complementations, but in the general case, there are two different types of operators. For the first type, let v be a vertex of the graph and a ∈ Fq, and we obtain a graph with labels g ′ ij = gij+agvigvj . For the second type of operators, let 0 6= b ∈ ...
متن کاملA faster algorithm to recognize even-hole-free graphs
Article history: Received 10 August 2013 Available online 11 February 2015
متن کاملA Fast Parallel Algorithm to Recognize P4-sparse Graphs
A number of problems in computational semantics, group-based collaboration, automated theorem proving, networking, scheduling, and cluster analysis suggested the study of graphs featuring certain \local density" characteristics. Typically, the notion of local density is equated with the absence of chordless paths of length three or more. Recently, a new metric for local density has been propose...
متن کاملA Faster Algorithm to Recognize Undirected Path Graphs
Let F be a nite family of nonempty sets. The undirected graph G is called the intersection graph of F if there is a bijection between the members of F and the vertices of G such that any two sets F i and F j (for i 6 = j) have a non-empty intersection if and only if the corresponding vertices are adjacent. We study intersection graphs where F is a family of undirected paths in an unrooted, undi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1984
ISSN: 0166-218X
DOI: 10.1016/0166-218x(84)90067-2